High Throughput Scheduling Algorithms for Input Queued Packet Switches

The high-performance computing paradigm needs high-speed switching fabrics to meet the heavy traffic generated by their applications. These are efficiently driven deployed scheduling algorithms. In this paper, we proposed two algorithms for input queued switches whose operations based on ranking procedures. At first, a Simple 2-Bit (S2B) scheme which uses binary procedure and queue size packets. Here, Virtual Output Queue (VOQ) set with maximum number of empty queues receives higher rank than other VOQ’s. Through simulation, showed S2B has better throughput performance Highest Ranking First (HRF) arbitration under uniform, non-uniform patterns. To further improve throughput-delay performance, an Enhanced (E2B) approach is proposed. This adopts integer representation rank, in VOQ set. simulation result shows E2B outperforms HRF performance. Furthermore, simulated hotspot proves be more efficient.